Non-interactive fuzzy private matching
ثبت نشده
چکیده
Two fuzzy private matching protocols are introduced to allow a client to securely compare a list of words to a server list, and discover only those words on the server list that are similar to his, while the server learns nothing. The first protocol achieves perfect client security, while the second achieves almostprivacy and perfect server security. Both protocols are efficient in both communication and computation complexity: for lists of length n, only O(n) communication and O(n) computation is needed.
منابع مشابه
2015 5th International Conference on IT Convergence and Security (ICITCS)
This paper proposes a new double-private protocol for fuzzy matching and -fuzzy matching. Many works have been done for private database search in which the keyword that a user inputs for the search is concealed to the database owner. In these database searches, the exactly matched data are returned to the user. Fuzzy matching has been proposed in which not exactly matched but nearly matched da...
متن کاملFuzzy Private Matching
In the private matching problem, a client and a server each hold a set of n elements as their input. The client wants to privately compute the intersection of these two sets: the client learns the elements it has in common with server (and nothing more), while the server obtains no information at all. In certain applications it would be useful to have a private matching protocol that reports a ...
متن کاملar X iv : 0 71 0 . 54 25 v 1 [ cs . C R ] 2 9 O ct 2 00 7 Fuzzy Private Matching ( Extended
In the private matching problem, a client and a server each hold a set of n input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain applications it would be useful to have a private matching protocol that reports a match even if...
متن کاملFuzzy Private Matching ( Extended
In the private matching problem, a client and a server each hold a set of n input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain applications it would be useful to have a fuzzy private matching protocol that reports a match e...
متن کاملEfficient Fuzzy Matching and Intersection on Private Datasets
At Eurocrypt’04, Freedman, Nissim and Pinkas introduced a fuzzy private matching problem. The problem is defined as follows. Given two parties, each of them having a set of vectors where each vector has T integer components, the fuzzy private matching is to securely test if each vector of one set matches any vector of another set for at least t components where t < T . In the conclusion of thei...
متن کامل